A Quick Algorithm for Binary Discernibility Matrix Simplification using Deterministic Finite Automata
نویسندگان
چکیده
منابع مشابه
Discernibility matrix simplification for constructing attribute reducts
This paper proposes a reduct construction method based on discernibility matrix simplification. The method works in a similar way to the classical Gaussian elimination method for solving a system of linear equations. Elementary matrix simplification operations are introduced. Each operation transforms a matrix into a simpler form. By applying these operations a finite number of times, one can t...
متن کاملA polynomial double reversal minimization algorithm for deterministic finite automata
We here propose a polynomial-time deterministic finite automaton minimization algorithm directly derived from Brzozowski’s double reversal algorithm. To do so, we take into account the framework by Brzozowski and Tamm, to propose an atomization algorithm that allows us to achieve polynomial time complexity. © 2013 Elsevier B.V. All rights reserved.
متن کاملA Practical Algorithm for Reducing Non- deterministic Finite State Automata
In [3], Ilie and Yu describe a construction of a right-invariant equivalence relation on the states of a non-deterministic finite-state automaton. We give a more efficient algorithm for constructing the same equivalence, together with results from a computer implementation.
متن کاملFast Algorithm for Attribute Reduction Based on Rough Set Theory Using Binary Discernibility Matrix
Rough set is a valid mathematical tool that deals with uncertain, vague and incomplete information of decision systems. Attribute reduction is one of the issues in rough set theory, and core attributes are indispensable in the process of attribute reduction. Recently, some researchers proposed the method of binary discernibility matrix to compute the results of attribute reduction, which can no...
متن کاملAn Incremental Algorithm for Minimal Deterministic Finite Cover Automata
A fast incremental algorithm for constructing minimal DFCA for a given language is presented. Since it was shown that the DFCA for a language L can have less states than the DFA for L, this techniques seems to be the best choice for incrementally building the automaton for a large language especially when the number of states in the DFCA is significantly less than the number of states in the “e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2018
ISSN: 2078-2489
DOI: 10.3390/info9120314